#include <stdio.h>
#include <string.h>

// R Sedgewick
#define MAX_NODES 256
typedef char node; 
#define key(A) (A)
#define less(A, B) (key(A) < key(B))
#define exch(A, B) {node t = A; A = B; B = t;} 
#define cmpexch(A, B) if (less(B, A)) exch(A, B)
  
int main()
{
  node v[MAX_NODES]="TABSORT"; 
  int i, j, l, r;
  l=0, r=strlen(v);
  for (i = l; i < r; i++)
    for (j = i; j > l; j--)
      cmpexch(v[j-1], v[j]);
  //for (i = l; i < r; i++) printf("%c", v[i]);
  return 0;
}
